Optimal Multicast Tree Routing for Cluster Computing in Hypercube Interconnection Networks

* This work was partially sponsored by Research Grant Council (RGC) of the Hong Kong under grants No. CityU1076/00E and CityU1055/01E. Abstract This paper proposes a set of novel efficient multicast routing algorithms on hypercube interconnection of cluster computers using multicast shared tree approach. We present some new algorithms for selecting an optimal core (root) for constructing the shared tree so as to minimize the average delay for multicast messages. Simulation results indicate that our algorithms are efficient in the senses of short end-to-end average delay, load balance and less resource utilizations over hypercube cluster connections.